Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
نویسندگان
چکیده
منابع مشابه
Minimizing Makespan in Flowshops with Pallet Requirements
We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...
متن کاملMinimizing makespan in hybrid flowshops
We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...
متن کاملMinimizing Makespan in Flowshops with Bounded Processing Times
CT : The two-machine flowshop scheduling problem of minimizing makespan is addressed where jobs have rocessing times which are bounded within certain intervals. The probability distributions of job processing hin intervals are not known. The only known information about job processing times is the lower and upper he decision about a solution of the problem, i.e., finding a sequence, has to be m...
متن کاملNo-wait flowshops with bicriteria of makespan and maximum lateness
In this work we study a flowshop scheduling problem in which jobs are not allowed to wait in-between machines, a situation commonly referred to as no-wait. The concerned criterion is to minimize a weighted sum of makespan and maximum lateness. A dominance relation for the case of three-machine is presented and evaluated by experimental designs. Several heuristics and local search methods are pr...
متن کاملMinimizing makespan in flowshop with time lags
We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFOR: Information Systems and Operational Research
سال: 1997
ISSN: 0315-5986,1916-0615
DOI: 10.1080/03155986.1997.11732335